Dynamics ofk-core percolation in a random graph
نویسندگان
چکیده
منابع مشابه
Dynamics of k-core percolation in a random graph
We study the edge deletion process of random graphs near a k-core percolation point. We find that the time-dependent number of edges in the process exhibits critically divergent fluctuations. We first show theoretically that the k-core percolation point is exactly given as the saddle-node bifurcation point in a dynamical system. We then determine all the exponents for the divergence based on a ...
متن کاملPercolation in a hierarchical random graph
We study asymptotic percolation as N → ∞ in an infinite random graph GN embedded in the hierarchical group of order N , with connection probabilities depending on an ultrametric distance between vertices. GN is structured as a cascade of finite random subgraphs of (approximate) Erdös-Renyi type. We give a criterion for percolation, and show that percolation takes place along giant components of...
متن کاملDynamics of k-core percolation
In many network applications nodes are stable provided they have at least k neighbours, and a network of k-stable nodes is called a k-core. The vulnerability to random attack is characterized by the size of culling avalanches which occur after a randomly chosen k-core node is removed. Simulations of lattices in two, three and four dimensions, as well as small-world networks, indicate that power...
متن کاملFirst passage percolation on the random graph
We study first passage percolation on the random graph Gp(N) with exponentially distributed weights on the links. For the special case of the complete graph this problem can be described in terms of a continuous time Markov chain and recursive trees. The Markov chain X(t) describes the number of nodes that can be reached from the initial node in time t. The recursive trees, which are uniform tr...
متن کاملCore percolation: a new geometric phase transition in random graphs
We study both numerically and analytically what happens to a random graph of average connectivity α when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated vertices plus an induced subgraph we call the core. In the thermodynamic limit of an infinite random graph, we compute analytically the dynamics of leaf removal, the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2009
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/42/7/075005